/*
 * Copyright (c) 2012, marco.tamburelli@gmail.com
 * All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met: 
 * 
 * 1. Redistributions of source code must retain the above copyright notice, this
 *    list of conditions and the following disclaimer. 
 * 2. Redistributions in binary form must reproduce the above copyright notice,
 *    this list of conditions and the following disclaimer in the documentation
 *    and/or other materials provided with the distribution. 
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
package org.bmi.gwt.mi.server.core.queue;

/**
 * Useful functions to manage queues expressions
 */
public class QueueExpressionUtil
{
	/**
	 * This function test if a provided queue expression match (is sub queue
	 * expression) an expression.
	 * 
	 * @param testExpr The queue expression to examine.
	 * @param cmpExpr The queue expression to compare with.
	 * @return
	 */
	public static boolean match(String testExpr, String cmpExpr)
	{
		char[] _expr = cmpExpr.toCharArray();
		char[] _queue = testExpr.toCharArray();

		if (_expr.length > _queue.length) return false;

		for (int i = 0; i < _expr.length; i++)
		{
			if (i == _expr.length - 1 && _expr[i] == '*') return true;
			if (_expr[i] != _queue[i]) return false;
		}

		return _expr.length == _queue.length;
	}

	public static String getMatcher(String queueName)
	{
		char[] arr = queueName.toCharArray();

		if (arr[0] == '*') return null;

		char[] buff = null;
		boolean foundDot = false;

		for (int i = arr.length - 1; i >= 0; i--)
		{
			if (!foundDot)
			{
				if (arr[i] == '.') foundDot = true;
				if (arr[i] == '*') i--;
			}

			if (foundDot)
			{
				if (buff == null)
				{
					buff = new char[i + 2];
					buff[i + 1] = '*';
				}

				buff[i] = arr[i];
			}
			else if (i == 0)
			{
				buff = new char[1];
				buff[0] = '*';
			}
		}

		return new String(buff);
	}
}
